منابع مشابه
A Local Branching Approach for the Set Covering Problem
The set covering problem (SCP) is a well-known combinatorial optimization problem. This paper investigates development of a local branching approach for the SCP. This solution strategy is exact in nature, though it is designed to improve the heuristic behavior of the mixed integer programming solver. The algorithm parameters are tuned by design of experiments approach. The proposed method is te...
متن کاملOn the Linking Set Problem
We consider the Linking Set Problem which occurs as a subproblem in a decomposition procedure to solve large scale p-median problems such as the Optimal Diversity Management Problem. We show that a greedy algorithm solves the Linking Set Problem when the costs have a special structure. This special structure usually occurs when the Linking Set Problem arises from the decomposition of location p...
متن کاملA note on 'Algorithms for connected set cover problem and fault-tolerant connected set cover problem'
A flaw in the greedy approximation algorithm proposed by Zhang et al. for minimum connected set cover problem is corrected, and a stronger result on the approximation ratio of the modified greedy algorithm is established. The results are now consistent with the existing results on connected dominating set problem which is a special case of the minimum connected set cover problem.
متن کاملA set coverage problem
This paper shows that with B = {1, 2, . . . , n}, the smallest k such that (B ×B)− {(j, j) | j ∈ B} = k ⋃ i=1 (Ci ×Di) is s(n), where s(n) is the smallest integer k such that n 6 ( k b k 2 c ) . This provides a simple set-based formulation and a new proof of a result for boolean ranks [2] and biclique covering of bipartite graphs [1, 5], making these intricate results more accessible.
متن کاملProblem Set 1 Solutions Problem Set Grading
The relay station simply rebroadcasts the signal it receives from the source, at exactly the instant that it receives it. The relay station therefore has no effect on the signal received by the observer, but it serves as a crutch for our thinking— it allows us to divide the problem into two parts, each already solved. Let ∆t denote the time interval between wave crests, with subscripts to indic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 1974
ISSN: 0097-3165
DOI: 10.1016/0097-3165(74)90104-6